On the relation between plausibility logic and the maximum-entropy principle: a numerical study

نویسنده

  • P. G. L. Porta Mana
چکیده

What is the relationship between plausibility logic and the principle of maximum entropy? When does the principle give unreasonable or wrong results? When is it appropriate to use the rule ‘expectation = average’? Can plausibility logic give the same answers as the principle, and better answers if those of the principle are unreasonable? To try to answer these questions, this study offers a numerical collection of plausibility distributions given by the maximum-entropy principle and by plausibility logic for a set of fifteen simple problems: throwing dice. PACS numbers: 02.50.Cw,02.50.Tt,01.70.+w MSC numbers: 03B48,60G09,60A05 Dedicato a mia madre per il suo trentesimo compleanno 1 When and how should the maximum-entropy principle be applied? For the student of plausibility logic1, the theory of the principles governing plausible inference, the application of the theory in any given problem is crystal clear in principle: (1) The problem is analysed and reduced to a set of propositions {Ai} and background knowledge I. (2) Some plausibilities P[Ai1 . . . Ai2 | (Ai3 . . . Ai4)∧ I] ∈ [0, 1] are assigned, consistently with the laws below, according to our actual or hypothetical knowledge of the situation and to convenience; the ‘Ai j . . .Aik ’ represent collections of Ais joined by various logical connectives (‘¬’, ‘∧’, ‘∨’, ‘⇒’). (3) Finally, using the basic laws P(¬Ai| I) = 1 − P(Ai| I), (1a) P(Ai ∧ A j| I) = P(Ai| A j ∧ I) P(A j| I), (1b) P(Ai ∨ A j| I) = P(Ai| I) + P(A j| I) − P(Ai ∧ A j| I), (1c) P(Ai ⇒ A j| I) = P(¬Ai| I) + P(A j| Ai ∧ I) P(Ai| I), (1d) Email: [email protected] (remove the z) 1I call ‘plausibility logic’ what many other authors call ‘(Bayesian) probability theory’. ‘Logic’, because it is a generalization of the truth-logical calculus. ‘Plausibility’, because ‘degree of belief’ is unfortunately too unwieldy and many authors still contend that ‘probability’ = ‘frequency’ or, perhaps worse, ‘probability’ = ‘(Lebesgue) measure’.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Bivariate Maximum Entropy Modeling

Let X=(X1 ,X2 ) be a continuous random vector. Under the assumption that the marginal distributions of X1 and X2 are given, we develop models for vector X when there is partial information about the dependence structure between X1  and X2. The models which are obtained based on well-known Principle of Maximum Entropy are called the maximum entropy (ME) mo...

متن کامل

Maximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

متن کامل

Comparison of entropy generation minimization principle and entransy theory in optimal design of thermal systems

In this study, the relationship among the concepts of entropy generation rate, entransy theory, and generalized thermal resistance to the optimal design of thermal systems is discussed. The equations of entropy and entransy rates are compared and their implications for optimization of conductive heat transfer are analyzed. The theoretical analyses show that based on entropy generation minimizat...

متن کامل

The concept of logic entropy on D-posets

In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied.  The invariance of the {it logic entropy} of a system  under isomorphism is proved. At the end,  the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...

متن کامل

Numerical and Analytical Approach for Film Condensation on Different Forms of Surfaces

This paper tries to achieve a solution for problems that concern condensation around a flat plate, circular and elliptical tube in by numerical and analytical methods. Also, it calculates entropy production rates. At first, a problem was solved with mesh dynamic and rational assumptions; next it was compared with the numerical solution that the result had acceptable errors. An additional suppor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0911.2197  شماره 

صفحات  -

تاریخ انتشار 2009